Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms
نویسندگان
چکیده
Article history: Received 16 April 2008 Available online 16 July 2008 Submitted by B. Cascales
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملطراحی ساختاری به روشDivide & Conquer و کاربرد آن در طراحی سوئیچ MSC
This paper presents the structural design for huge systems using Divide & Conquer (D&C) method as a scientific method for optimum designing of complex systems. This method divides the main system into several simple subsystems. Submitted equations in three different cases prove that the optimum response (number of subsystems for minimum system complexity) is independent of main system complexit...
متن کاملCounting independent sets via Divide Measure and Conquer method
Abstract. In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time O(1.1394) for subcubic graphs and in time O(1.2369) for general graphs, where n is the number of vertices in the instance graph, and polynomial space. The result comes from combining two well known methods “Divide and Conquer” and “Measure and Conquer”. We introduce ...
متن کاملAnalysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting
This paper exploits the notion of \unnn-ished sites" in the average-case analysis of k-dimensional divide-and-conquer algorithms. This general result is then applied to the 2D case, and it is shown that the divide-and-conquer construction of the Delaunay triangulation of a set of planar points quasi-uniformly distributed in a square may be done in expected linear time after a two-directional pr...
متن کاملApplication of Probabilistic Clustering Algorithms to Determine Mineralization Areas in Regional-Scale Exploration Studies
In this work, we aim to identify the mineralization areas for the next exploration phases. Thus, the probabilistic clustering algorithms due to the use of appropriate measures, the possibility of working with datasets with missing values, and the lack of trapping in local optimal are used to determine the multi-element geochemical anomalies. Four probabilistic clustering algorithms, namely PHC,...
متن کامل